Epoll optimisations

ABSTRACT

A method for managing I/O event notifications in a data processing system comprising a plurality of applications and an operating system having a kernel and an I/O event notification mechanism operable to maintain a plurality of I/O event notification objects each handling a set of file descriptors associated with one or more I/O resources. For each of a plurality of application-level configuration calls: intercepting at a user-level interface a configuration call from an application to the I/O event notification mechanism for configuring an I/O event notification object; and storing a set of parameters of the configuration call at a data structure, each set of parameters representing an operation on the set of file descriptors handled by the I/O event notification object; and subsequently, upon meeting a predetermined criterion: the user-level interface causing the plurality of configuration calls to be effected by means of a first system call to the kernel.

PRIORITY CLAIM

This application is a divisional of the U.S. application Ser. No. 13/158,176, “Epoll Optimisations”, filed on Jun. 10, 2011, which claims benefit to U.S. Provisional Application 61/470,396, “Epoll Optimisations,”, filed on Mar. 31, 2011, both of which are hereby incorporated by reference for all purposes.

BACKGROUND OF THE INVENTION

This invention relates to methods for managing I/O event notifications in a data processing system and to methods for minimising the latency and jitter associated with the management of I/O event notifications.

Typically, input and output (I/O) operations in an operating system will be handled using file descriptors, which are abstract indicators that can provide a reference to the files, sockets, FIFOs, block or character devices, or other I/O resources maintained by the operating system. Processes running on the operating system use the file descriptors in calls to the operating system in order to reference the files, sockets etc. of the system, with the operating system maintaining a kernel-resident data structure containing the correspondence between each file descriptor and resource (file, socket etc.) of the system. This allows, for example, an application to read from a particular file by means of a read( ) system call to the operating system that includes the file descriptor associated with that file. The operating system looks up the file corresponding to the provided file descriptor and, if the necessary permissions are satisfied, performs the requested read operation on behalf of the application.

An operating system generally provides several mechanisms for managing the file descriptors that are used for I/O. For example, in Linux, the select, poll and epoll mechanisms are provided as part of the system call API, each of which allows a process to monitor sets of file descriptors for an event such as a file descriptor becoming ready to perform I/O, or data being updated at the memory location identified by the file descriptor. The sets of file descriptors that an application wishes to monitor are typically held in objects that can be managed through the mechanisms provided by the operating system, with each object holding a set of file descriptors relating to the application. For example, in Linux an application can establish an epoll instance for handling a set of file descriptors that the application wishes to monitor, the epoll instance being managed by means of epoll_create( ), epoll_ctl( ) and epoll_wait( ) system calls provided by the epoll mechanism.

Each of the mechanisms will typically have different performance characteristics. For example, the epoll_wait( ) system call is more efficient than the equivalent select( ) and poll( ) calls when the set of file descriptors is large. However, the epoll mechanism is relatively inefficient when the set of monitored file descriptors and I/O events changes because this additionally requires calls to epoll_ctl( ). Since the calls to a kernel mechanism such as epoll are system calls, they require a context switch from the application making the call into the kernel and are therefore relatively expensive in terms of processing overhead. Each context switch consumes processing resources and can introduce unwanted latency into the system. Epoll is typically used as follows:

/* Create an epoll set. */ epoll_set = epoll_create(...); /* Add file descriptor(s) to the set. */ epoll_ctl(epoll_set, EPOLL_CTL_ADD, fd, event); /* Wait for file descriptors in set to become ready. */ n_events = epoll_wait(epoll_set, events, maxevents, timeout); /* Use the file descriptors that are ready. */ for( i = 0; i < n; ++i )...

In contrast, with the select or poll mechanisms, the set of file descriptors to monitor is supplied in a single select( ) or poll( ) call that also waits for the file descriptors to become ready. For example, the above epoll use can be achieved as follows with poll:

/* Add file descriptor(s) to a set. */ pfds[n_fds].fd = fd; pfds[n_fds].events = POLLIN; ++n_fds; /* Wait for file descriptors in set to become ready. */ n_events = poll(pfds, n_fds, timeout); /* Use the file descriptors that are ready. */ for( i = 0; i < n; ++i )...

Thus, the poll and select mechanisms tend to be more efficient when the set of file descriptors to be monitored changes frequently over time, and the epoll mechanism tends to be more efficient when the set of file descriptors is relatively large and remains relatively static.

Another problem with conventional I/O event notification mechanisms is that they can introduce significant latency and jitter into the processing performed by the threads of an application due to the blocking of I/O event notification threads that are waiting for events at the descriptors monitored by the application. This is of particular concern in data processing systems that have user-level network stacks operating over high bandwidth network interface devices. In order to provide a low latency, high speed data path between a user-level stack and its network interface device, it is generally important to minimise the latency and jitter experienced by the stack due to kernel processes.

There is therefore a need for an I/O event notification mechanism that can be efficiently used with large sets of file descriptors when the set of file descriptors changes frequently. There is also a need for improved mechanisms for invoking system calls so as to minimise the latency and jitter associated with the management of I/O event notifications.

SUMMARY OF THE INVENTION

According to a first aspect of the present invention there is provided a method for managing I/O event notifications in a data processing system, the data processing system comprising a plurality of applications and an operating system having a kernel and an I/O event notification mechanism operable to maintain a plurality of I/O event notification objects each handling a set of file descriptors associated with one or more I/O resources, the method comprising: for each of a plurality of application-level configuration calls: intercepting at a user-level interface a configuration call from an application to the I/O event notification mechanism for configuring an I/O event notification object; and storing a set of parameters of the configuration call at a data structure, each set of parameters representing an operation on the set of file descriptors handled by the I/O event notification object; and subsequently, on a predetermined criterion being met: the user-level interface causing the plurality of configuration calls to be effected by means of a first system call to the kernel.

Preferably the method further comprises, subsequent to each intercepting step, returning processing to the application that made the respective configuration call. Preferably the intercepting and storing steps are performed without invoking any system calls.

Suitably the I/O event notification mechanism is configured such that each file descriptor of an I/O event notification object is individually configurable by means of a configuration call from the application to the I/O event notification mechanism.

Preferably the step of causing the plurality of configuration calls to be effected comprises: the user-level interface making the first system call to the kernel so as to pass the data structure to a kernel library; and the kernel library invoking a configuration routine of the I/O event notification mechanism for each set of parameters stored in the data structure so as to configure the I/O event notification object in accordance with the configuration calls. The data structure could be passed to the kernel library by one of: passing a reference to the data structure, passing a copy of at least part of the data structure, and passing a representation of the data structure into the kernel context. Suitably the I/O event notification mechanism is epoll and the configuration routine is epoll_ctl( ).

Each operation on the set of file descriptors held by the I/O event notification object could be an operation to add a file descriptor to the set, modify an event type to be monitored by the I/O event notification object in respect of a file descriptor of the set, or delete a file descriptor from the set of file descriptors.

Preferably the method further comprises, prior to the invoking step: combining into a single operation those operations represented by the sets of parameters stored at the data structure that are associated with the same file descriptor of the I/O event notification object; and replacing the operations represented by those sets of parameters with the single operation in the invoking step. The single operation could be do nothing if the operations represented by the sets of parameters stored at the data structure cancel each other out. Preferably the combining step is performed by the user-level interface or the kernel library.

Preferably the method further comprises intercepting at the user-level interface a wait call from the application to the I/O event notification mechanism for causing the I/O event notification object to wait for an event associated with one or more of its file descriptors, and the predetermined criterion being the reception of a wait call from the application at the user-level interface. Preferably the predetermined criterion is additionally met if no wait call is received at the user-level interface but one of the following occurs: a predetermined time period expires; or the storage space required at the data structure for storing the sets of parameters representing operations to be performed on the set of file descriptors handled by the I/O event notification object exceeds a predetermined size.

Preferably the method further comprises, subsequent to the step of causing the plurality of configuration calls to be effected, the user-level interface causing the I/O event notification object to wait for an event associated with one or more of the file descriptors of the I/O event notification object by means of a second system call to the kernel. Preferably the second system call is to the kernel library and the step of causing the I/O event notification object to wait for an event comprises invoking a wait routine of the I/O event notification mechanism. Suitably the I/O event notification mechanism is epoll and the wait routine is epoll_wait( ) or epoll_pwait( ). Preferably the first and second system calls are made by means of a single unified system call from the user-level interface to the kernel library.

Suitably the operating system comprises a plurality of I/O event notification objects and the user-level interface relates to a single I/O event notification object. Suitably the I/O event notification object handles a set of file descriptors corresponding to a network interface device. The file descriptors could correspond to receive or transmit buffers. The user-level interface could be provided at a user-level network stack.

Preferably the method further comprises the step of not enabling interrupts at the operating system in respect of file descriptors on which the operations represented by the sets of parameters stored at the data structure are operations to add or modify a file descriptor managed by the user-level network stack.

According to a third aspect of the present invention there is provided a data processing system comprising: a plurality of applications; an operating system having a kernel and an I/O event notification mechanism operable to maintain a plurality of I/O event notification objects each handling a set of file descriptors associated with one or more I/O resources; a data structure operable to store parameters of application-level configuration calls, each set of parameters representing an operation on the set of file descriptors handled by the I/O event notification object to which the respective configuration call is directed; and a user-level interface configured to intercept a plurality of configuration calls from an application to the I/O event notification mechanism for configuring an I/O event notification object and store parameters of the configuration calls at the data structure; wherein the user-level interface is configured to, on a predetermined criterion being met, cause the plurality of configuration calls to be effected by passing at least part of the data structure into the kernel context and invoking a system call to the kernel.

According to a second aspect of the present invention there is provided a method for processing a blocking system call at a data processing system comprising an operating system that supports kernel and user-level contexts, the method comprising: intercepting a blocking system call from an entity running a kernel or user-level context; and repeatedly invoking the system call in non-blocking mode until one of the following conditions is satisfied: a non-blocking system call returns a value; or a first predetermined time period expires; and on one of the conditions being satisfied, returning to the entity a response to its blocking system call comprising a value returned by a non-blocking system call or a notification that the first predetermined time period expired.

Preferably the method further comprises, on one of the conditions being satisfied, enabling interrupts for the entity on the entity next becoming blocked.

Preferably the first predetermined time period is a timeout of the entity indicating the maximum length of time before the blocking call is to return.

Preferably the step of repeatedly invoking the system call in non-blocking mode comprises: repeatedly invoking the system call in non-blocking mode for no longer than a maximum length of time expressed by a second predetermined time period; and if the second predetermined time period expires: invoking the system call in blocking mode; and

enabling interrupts for the entity.

Preferably each non-blocking system call is invoked with a timeout parameter of zero.

Suitably the intercepting step is performed in the kernel context. Alternatively, the intercepting step is performed at a user-level interface, the user-level interface: replacing the blocking system call with a new system call; and causing, by means of the new system call, the step of repeatedly invoking the system call to be performed in the kernel context.

Preferably the data processing system comprises a plurality of CPU cores.

Preferably the step of repeatedly invoking the system call in non-blocking mode further comprises not enabling interrupts for the entity whilst the system call is being repeatedly invoked in non-blocking mode. Preferably the step of repeatedly invoking the system call in non-blocking mode further comprises not enabling interrupts for the entity in respect of the non-blocking system calls.

Suitably the operating system is Linux and the blocking system call is one of epoll( ), select( ), poll( ), read( ), write( ), send( ), recv( ), accept( ) and futex( ).

DESCRIPTION OF THE DRAWINGS

The present invention will now be described by way of example with reference to the accompanying drawings, in which:

FIG. 1 is a schematic diagram of a data processing system of a conventional data processing system.

FIG. 2 is a schematic diagram of a data processing system configured in accordance with the present invention.

FIG. 3 is a flow diagram illustrating processing a blocking system call at a data processing system, according to an embodiment of the invention.

DETAILED DESCRIPTION OF THE DRAWINGS

The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art.

The general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

The present invention is for use at a data processing system having an operating system that provides an I/O event notification mechanism at its kernel and that is operable to support a plurality of user-level applications. A data processing system could be a server, personal computer, network switch, or any other kind of computing device having a baseboard, one or more CPU cores, a memory and a set of I/O resources. The operating system could be any operating system that provides an I/O event notification mechanism configurable by user-level applications by means of a system call. For example, the operating system could be Linux, FreeBSD, Solaris, or Windows.

According to a first aspect of the present invention there is provided a method for improving the effective performance of an I/O event notification mechanism operable to manage I/O event notification objects handling a plurality of file descriptors. In particular, the first aspect of the present invention is advantageous if each file descriptor entry of an I/O event notification object must be individually configured by means of a system calls from the respective user-level application to the I/O event notification mechanism.

A schematic diagram of a conventional data processing system is shown in FIG. 1. Data processing system 100 comprises an operating system 101 that provides an I/O event notification mechanism 104 in the kernel context through which I/O event notification objects 105 and 106 may be managed. The operating system supports applications 102 and 103 at user-level 107. In this example, the operating system is Linux, the I/O event notification mechanism is epoll, and the I/O event notification objects are epoll instances.

In the conventional data processing system of FIG. 1, the file descriptors of an epoll instance 105 are configured as follows. Application 102 makes a set of epoll_ctl( ) system calls 108, each epoll_ctl( ) call being a request to add a descriptor to the set of descriptors handled by its epoll instance 105, to modify the event type monitored in respect of a descriptor of the set, or to delete a descriptor of the set. Each epoll_ctl( ) call specifies the file descriptor to which it corresponds and identifies the event type that the epoll instance is to monitor for that file descriptor.

Each system call causes a context switch from the user-level context 107 into the kernel context 109 so as to pass the parameters of the call from the application to epoll. The five epoll_ctl( ) calls shown in FIG. 1 therefore involve five context switches to and from the user-level context and the kernel context. Once the application has configured the set of descriptors of the epoll instance 105, the application makes an epoll_wait( ) system call so as to cause epoll to start waiting for the identified event types of each of the set of descriptors. To configure and start an epoll instance therefore requires six context switches in total to and from user-level into the kernel.

FIG. 2 shows a data processing system configured in accordance with the present invention. Data processing system 200 comprises an operating system 201, that provides an I/O event notification mechanism 204 in the kernel context through which I/O event notification objects 205 and 206 may be managed. The operating system supports applications 202 and 203 at user-level 207. The data processing system further comprises a user-level interface 210 for intercepting system calls from the applications to the I/O event notification mechanism, and a kernel library 213 for directly calling routines of the I/O event notification mechanism. Kernel library 213 operates in the context of the kernel 209.

The operation of the present invention will now be described by example. In this example the operating system is Linux, the I/O event notification mechanism is epoll, and the I/O event notification objects are epoll instances. In order to configure the descriptors handled by its epoll instance 205, an application 202 makes the same set of epoll_ctl( ) system calls 208 as in FIG. 1. The present invention does not therefore require any modification to applications which can continue to make the same calls to epoll in the same way. However, in FIG. 2, each epoll_ctl( ) call is intercepted by the user-level interface 210 so that the calls do not cause a switch into the kernel context. For example, in Linux, the user-level interface could be configured to intercept calls using the LD_PRELOAD mechanism.

On intercepting each epoll_ctl( ) call, the user-level interface stores the parameters of the call at a data structure 211 that may or may not be provided at user-level interface 210 but which can be written to in the user-level context without the need for a context switch into the kernel. Processing returns to the application 202 after each call is intercepted without any system calls being invoked. In this manner, a set of parameters for each epoll_ctl( ) call made by the application is stored at the data structure. There is no limitation as to how the parameters can be stored at the data structure provided that sufficient information is retained to allow the epoll_ctl( ) calls to be recreated: copies of the epoll_ctl( ) calls themselves could be stored, copies of the significant parameters of the epoll_ctl( ) calls could be stored, or the data structure could hold a representation of the epoll_ctl( ) calls or their significant parameters.

At a later time, when several epoll_ctl( ) calls directed to epoll instance 205 may have been intercepted and their parameters stored at the data structure, the user-level interface makes a single system call 212 so as to pass the aggregated parameters of the stored epoll_ctl( ) calls to the kernel library 213. This system call 212 will be termed epoll_ctl_many( ). The system call may pass the parameters to the kernel library by passing a reference (such as a file descriptor) to the data structure or its relevant parts, passing a copy of at least part of the data structure, or passing some other representation of the information content of the data structure.

Once processing has passed to the kernel library, the kernel library calls epoll_ctl( ) 214 for each set of parameters stored in the data structure so as to effect the epoll configuration operations represented by the sets of parameters. Since the kernel library operates within the kernel context these calls do not involve a context switch from user-level into the kernel. Thus, the present invention replaces multiple system calls from the application with a single system call from the user-level interface, reducing the number of context switches between the kernel and user-level, and hence reducing CPU overhead and improving system performance.

Each application may have multiple epoll instances and there may be multiple applications; an operating system might therefore maintain many epoll instances. Preferably the data structure can store the parameters of epoll_ctl( ) calls that relate to different epoll instances. However, the user-level interface is preferably configured to aggregate only those configuration calls that relate to a particular epoll instance. This is readily achieved by grouping parameters in the data structure according to the epoll instance to which they relate.

The user-level interface is preferably configured to defer making the system call epoll_ctl_many( ) until the application calls epoll_wait( ). This can be achieved by arranging that the user-level interface additionally intercepts epoll_wait( ) calls from the application to epoll. Once an epoll_wait( ) call has been intercepted, the user-interface can be configured to handle the call in one of two ways.

Firstly, the user-level interface can be configured to make the epoll_ctl_many( ) system call so as to cause the kernel library to configure epoll instance 205 in accordance with the epoll_ctl( ) calls that originated from the application, and then to make either an epoll_wait( ) system call directly to epoll, or a second system call to the kernel library so as to cause the kernel library to call epoll_wait( ).

Secondly and preferably, the user-level interface is configured to make a single epoll_ctl_and_wait( ) call to the kernel library so as to cause the kernel library to configure epoll instance 205 in accordance with the epoll_ctl( ) calls that originated from the application and then call epoll_wait( ). This is preferable because it allows an epoll instance to be configured and started with one fewer context switch, further reducing the CPU overhead associated with managing I/O event notification objects.

It can be useful to arrange that in the absence of an epoll_wait( ) call from the application, the user-interface makes the epoll_ctl_many( ) call when a timer reaches a predetermined value or when the storage space required at the data structure for storing the sets of parameters exceeds a predetermined size. This can avoid having a significant number of epoll configuration operations represented by the sets of parameters becoming backed-up at the data structure.

Often, a configuration call to epoll from an application will override or cancel the effect of an earlier call associated with the same file descriptor. Further efficiency gains can be made by combining those epoll configuration operations represented by the sets of parameters at the data structure that are associated with the same file descriptor. The kernel library is configured to call epoll_ctl( ) using the parameters of the combined operation for any descriptors in respect of which there are multiple operations represented in the data structure. This is preferably performed at the user-level interface but could alternatively be performed at the kernel library prior to the kernel library calling epoll_ctl( ) for each set of parameters stored at the data structure for epoll instance 205. The following table shows how epoll configuration operations can be combined:

1st operation 2nd operation Combined operation EPOLL_CTL_ADD EPOLL_CTL_MOD EPOLL_CTL_ADD EPOLL_CTL_ADD EPOLL_CTL_DEL cancel EPOLL_CTL_MOD EPOLL_CTL_MOD EPOLL_CTL_MOD EPOLL_CTL_MOD EPOLL_CTL_DEL EPOLL_CTL_DEL EPOLL_CTL_DEL EPOLL_CTL_ADD EPOLL_CTL_MOD or cancel

Thus, an operation to add a new file descriptor to an epoll instance followed by an operation to modify the event to which that descriptor relates can be expressed as a single operation to add a new file descriptor having the modified event. Successive operations to add and then delete the same descriptor cancel one another out, although successive operations to delete and then add the same descriptor may not cancel one another out because the operation to add a descriptor may be associated with a different event type to the operation to delete that descriptor. Successive operations to modify the event to which a descriptor relates can generally be expressed by the last modify operation.

The present application finds particular application in data processing systems that include a user-level network stack configured to perform protocol processing of data received over or to be transmitted over a network interface device. Such user-level stacks typically handle large numbers of file descriptors that relate to receive and transmit queues of the data processing system. Furthermore, since receive and transmit queues can be rapidly re-configured as connections are established and taken down, it is advantageous for the PO event notification mechanisms to be as efficient as possible. This is of particular concern in data servers that might make thousands of new connections a second.

In data processing systems having a user-level network stack, the user-level interface 210 is preferably provided at the user-level network stack. There can be multiple user-level interfaces per data processing system, each being part of a different user-level network stack.

According to a second aspect of the present invention there is provided a method for reducing the latency and jitter of an I/O event notification mechanism operable to manage I/O event notification objects handling a plurality of file descriptors. In particular, the second aspect of the present invention is advantageous in data processing systems having multiple CPU cores.

Conventionally, when an I/O event notification object is invoked by a system call, the object blocks until new I/O events are available for one of the descriptors handled by the I/O event notification object. For example, epoll_wait( ) is generally invoked by an application for an epoll instance such that the routine blocks until I/O events are available for one of the descriptors handled by that instance.

The second aspect of the present invention provides a way in which such blocking calls to an I/O event notification object are replaced by a busy-wait loop that repeatedly makes non-blocking calls to an I/O event notification object with a timeout of zero such that the object returns immediately after it is invoked. This will be described with reference to FIG. 2 by way of an example in which the operating system is Linux, the I/O event notification mechanism is epoll, and the I/O event notification objects are epoll instances.

Consider the preferred embodiment described above in relation to FIG. 2 and the first aspect of the present invention in which kernel library 213 calls epoll_wait( ) on behalf of application 202. Instead of invoking epoll_wait( ) by means of a conventional blocking call, the kernel library performs a busy-wait loop that repeatedly invokes epoll_wait( ) in non-blocking mode with a timeout of zero. The loop is performed until I/O events become available for one of the descriptors handled by the respective epoll instance 205, or a timeout specified in the busy-wait loop expires. If a non-blocking call returns an I/O event, the busy-wait loop exits and an indication of the I/O event is returned to the application. The timeout specified in the busy-wait loop expresses the maximum time that the busy-wait loop should spin for and is preferably user-configurable. If the busy-wait loop timeout expires then preferably a blocking system call is invoked and interrupts are enabled for the application.

FIG. 3 is a flow diagram illustrating processing a blocking system call at a data processing system, according to an embodiment of the invention. In Step 310, a blocking system call from an entity running in a kernel context or user-level context is intercepted. In Step 320, the system call is invoked in non-blocking mode. In Step 330, if the non-blocking system call returns a value, then in Step 335 a response to its blocking system call is returned to the entity, the response comprising the value returned by the system call invoked in non-blocking mode. If the non-blocking system call does not return a value, then in Step 340, determine whether a first predetermined time period has expired. If the first time period has expired, then in Step 345, return to the entity a response indicating that the first predetermined time period expired. If the first time period has not expired, then repeat the loop starting in Step 320 to invoke the system call in non-blocking mode.

There may additionally be a timeout specified by application 202 which specifies the maximum time before the blocking system call it attempts to invoke should return. The application timeout is specified by the application and typically forms a standard part of the system call API. The busy-wait loop is configured to exit on this timeout being reached and an indication is returned to the application that its timeout expired.

The busy-wait loop could be configured as follows:

int epoll_busy_wait(epoll_set, events, max_events, timeout) { do { rc = epoll_wait(epoll_set, events, max_events, 0 /* nonblocking */); if( rc != 0 ) return rc; if( timeout_exceeded(timeout) ) return 0; } while( ! timeout_exceeded(busy_wait_timeout) ); /* Subtract time spent busy-waiting from timeout. */ timeout = timeout − busy_wait_timeout; return epoll_wait(epoll_set, events, max_events, timeout); }

By repeatedly invoking epoll_wait( ) in a non-blocking mode, the latency experienced by the entity making the system call (in this case the kernel library, but more generally an application) is reduced because the thread that invoked epoll_wait( ) does not need to be woken when an I/O event becomes available—the thread is active since it invoked epoll_wait( ) with a zero timeout and is waiting for an immediate response. Furthermore, the inventors have recognised that in multi-core data processing systems, because the CPU core on which epoll_wait( ) is running is kept busy by the looping code, jitter in the system is also reduced. This is because the task scheduler of the operating system is likely to schedule threads to other less busy cores in preference to the CPU core consumed by the code loop. It is of particular importance to minimise jitter in data processing systems having user-level network stacks operating over high bandwidth network interface devices, such as 10 GigE and 40 GigE devices.

The busy-wait loop can be embodied in a routine provided by the kernel library and invoked by a system call from the user-level interface (e.g. epoll_ctl_many( ) or epoll_ctl_and_wait( )). Thus, in preference to invoking epoll_wait( ) in the conventional manner, the kernel library is configured to instead repeatedly invoke epoll_wait( ) in a non-blocking mode in accordance with the second aspect of the present invention. Alternatively, the busy-wait loop can replace the standard kernel implementation of epoll_wait( ) such that the busy-wait loop is performed when epoll_wait( ) is called. Least preferably, the busy-wait loop can be implemented at user-level (for example, at the user-level interface 210). However, this causes a single blocking system call to epoll_wait( ) to be converted into multiple non-blocking system calls to epoll_wait( ) and significantly increases latency.

The second aspect of the present invention is not limited to use with I/O event notification mechanisms and is equally applicable to all system calls in an operating system that block. For example, on Linux other system calls that can be invoked according to the second aspect of the present invention include select( ), poll( ), read( ), write( ), send( ), recv( ), accept( ) and futex( ).

In a most preferred embodiment of the present invention, the first and second aspects of the invention are implemented (advantageously in their preferred forms) at a user-level network stack, such as the OpenOnload stack. Thus, user-level interface 210 is provided at the user-level network stack. The kernel library 213 may be installed into the operating system on installing the user-level stack. For example, the user-level stack may form part of a software package for use with a network interface device coupled to the data processing system, and the kernel library could form part of that software package. The kernel library could be provided at a driver for such a network interface device.

Preferably a user-level interface at a user-level network stack is configured to intercept only those I/O event notification configuration calls that relate to descriptors handled by the user-level network stack.

It is generally desirable to avoid interrupting an application whilst it is running so as to avoid unwanted CPU load and jitter. This is particularly true when an application is transmitting and/or receiving data over a network interface device (typically provided as a peripheral card in a data processing system, e.g. a PCIe NIC). It is therefore desirable that user-level network stacks are configured so as to avoid interrupting an application communicating by means of the stack whilst that application is running, but to enable interrupts when the application blocks whilst waiting for network I/O. Interrupts are required when an application is blocked in order to wake the application in a timely manner and handle network events.

With respect to the present invention, interrupts are therefore preferably handled in the following ways. When the user-level interface intercepts an epoll_ctl( ) call, the user-level interface does not cause interrupts to be enabled for the application in respect of the epoll instance. If necessary, the user-level interface is configured to prevent interrupts being enabled for the application in respect of the epoll instance. In the case in which the user-level interface is at a user-level network stack, the application does not cause or prevents interrupts being enabled for the application in respect of the epoll instance for file descriptors handled by the user-level network stack.

Preferably, interrupts are not enabled for an application in respect of the epoll instance while a busy-wait loop is running. For example, in the preferred embodiments, when a system call is invoked to cause the kernel library to start an epoll instance, the kernel library does not enable (or prevents from being enabled) interrupts for the respective application whilst the busy-wait loop with which the I/O events are monitored is running. More generally, it is preferable that a data processing system is configured to not enable (or prevent interrupts being enabled) for the respective application when epoll_wait( ) is invoked as a non-blocking call. This is most preferable in respect of epoll instances handling file descriptors managed by a user-level network stack. Interrupts are preferably then enabled when the busy-wait timeout is exceeded and the application goes on to block. Interrupts are preferably also enabled when the epoll instance receives an event and the application goes on to block.

An exemplary implementation of a unified system call provided by the kernel library for configuring and starting an epoll instance is set out in pseudo “C” code in Annex A. This call would be invoked by a user-level interface so as to configure an epoll instance in accordance with the deferred operations stored at the data structure, start the epoll instance using a busy-wait loop and supress interrupts in the manner described above.

The present invention has been described herein with reference to the epoll I/O event notification mechanism provided in the Linux operating system. However, the present invention is not limited to a particular operating system and equally finds application in other operating systems, such as FreeBSD (in which the epoll equivalent is kqueue) and Solaris (which provides an analogous event completion API). The present invention applies equally to both non-virtualised and virtualised instances of operating systems.

The applicant hereby discloses in isolation each individual feature described herein and any combination of two or more such features, to the extent that such features or combinations are capable of being carried out based on the present specification as a whole in the light of the common general knowledge of a person skilled in the art, irrespective of whether such features or combinations of features solve any problems disclosed herein, and without limitation to the scope of the claims. The applicant indicates that aspects of the present invention may consist of any such individual feature or combination of features. In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention.

Annex A

An exemplary implementation of a unified system call provided by the kernel library for configuring and starting an epoll instance.

int onload_epoll_wait(epoll_set, events, max_events, timeout, busy_wait_timeout, deferred_epoll_ctl_ops) { /* Prevent interrupts from being enabled when the real epoll_ctl( ) and  * epoll_wait( ) calls are invoked.  */ onload_suppress_interrupts( ); /* Invoke any deferred epoll_ctl( ) operations with interrupts  * suppressed.  */ for_each(deferred_epoll_ctl_ops)  epoll_ctl(epoll_set, op, fd, event); /* Invoke real epoll_wait( ) with interrupts suppressed. Busy-wait if  * configured to do so.  */ do {  rc = epoll_wait(epoll_set, events, max_events, 0 /* nonblocking  */);  if( rc != 0 ) return rc;  if( timeout_exceeded(timeout) ) return 0; } while( ! timeout_exceeded(busy_wait_timeout) ); /* Subtract time spent busy-waiting from timeout. */ timeout = timeout − busy_wait_timeout; /* Enable interrupts for each stack associated with the set of  * file descriptors in the epoll set.  */ onload_enable_interrupts( ); return epoll_wait(epoll_set, events, max_events, timeout); } 

We claim:
 1. A method for processing a blocking system call at a data processing system comprising an operating system that supports kernel and user-level contexts, the method comprising: intercepting a blocking system call from an entity running in a kernel context or user-level context, wherein when executed the blocking system call invokes an operation and blocks until the operation occurs; in response to intercepting the blocking system call, instead of executing the blocking system call, repeatedly executing the system call in non-blocking mode for a first timeout period; and in response to determining that the system call in non-blocking mode has not returned a value within the first timeout period, subtracting the first timeout period from a second timeout period and executing the blocking system call for a remainder of the second timeout period after subtraction.
 2. A method as claimed in claim 1, further comprising, in response to determining that the system call in non-blocking mode has not returned a value within the first timeout period, enabling interrupts for the entity.
 3. A method as claimed in claim 1, wherein the system call is executed in non-blocking mode with a third timeout of zero.
 4. A method as claimed in claim 1, wherein the intercepting step is performed in the kernel context.
 5. A method as claimed in claim 1, wherein the intercepting step is performed at a user-level interface, the user-level interface: replacing the blocking system call with a new system call; and causing, by means of the new system call, the step of repeatedly executing the system call in non-blocking mode to be performed in the kernel context.
 6. A method as claimed in claim 1, wherein the data processing system comprises a plurality of CPU cores.
 7. A method as claimed in claim 1, wherein the step of repeatedly executing the system call in non-blocking mode further comprises not enabling interrupts for the entity whilst the system call is being repeatedly executed in non-blocking mode.
 8. A method as claimed in claim 1, wherein the step of repeatedly executing the system call in non-blocking mode further comprises not enabling interrupts for the entity in respect of the system calls.
 9. A method as claimed in claim 1, wherein the operating system is Linux and the blocking system call is one of epoll( ) select( ) poll( ) read( ) write( ), send( ) recv( ) accept( ) and futex( ).
 10. A method as claimed in claim 1, wherein the first timeout period expresses a maximum number of times that the system call is to be executed in non-blocking mode.
 11. A data processing system comprising a memory and one or more processors coupled to the memory, the one or more processors configured to execute an operating system that supports kernel and user-level contexts, the memory having stored therein a plurality of software code portions defining logic for: intercepting a blocking system call from an entity running in a kernel context or user-level context, wherein when executed the blocking system call invokes an operation and blocks until the operation occurs; in response to intercepting the blocking system call, instead of executing the blocking system call repeatedly executing the system call in non-blocking mode for a first timeout period; and in response to determining that the system call in non-blocking mode has not returned a value within the first timeout period, subtracting the first timeout period from a second timeout period and executing the blocking system call for a remainder of the second timeout period after subtraction. 